Time–energy trade-offs in processing divisible loads on heterogeneous hierarchical memory systems
نویسندگان
چکیده
منابع مشابه
Divisible Loads Scheduling in Hierarchical Memory Systems with Time and Energy Constraints
In this paper we consider scheduling distributed divisible computations in systems with hierarchical memory for energy and time performance criteria. Hierarchical memory allows to conduct computations on big data sets using out-of-core processing instead of coercing application data t into core storage. However, out-of-core computations are more costly both in time and energy. A model for sched...
متن کاملTrade-offs in Replicated Systems
Replicated systems provide the foundation for most of today’s large-scale services. Engineering such replicated system is an onerous task. The first—and often foremost—step in this task is to establish an appropriate set of design goals, such as availability or performance, which should synthesize all the underlying system properties. Mixing design goals, however, is fraught with dangers, given...
متن کاملTime - Memory - Processor Trade - offs HAMID
-It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C,, the cost per solution, and C,,,, the cost of the machine: doubling C,,, increases the solution rate by a factor of fou...
متن کاملTime-Memory Trade-Offs for Near-Collisions
In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider only hash computations, it is easy to compute a lower-bound for the complexity of near-collision algorithms, and to build a matching algorithm. However, this algorithm needs a lot of memory, and makes more than 2 memory accesses. Recently, several algorithms have been proposed without this mem...
متن کاملPoznań University of Technology Multi - Installment Divisible Loads Scheduling in Systems with Limited Memory
In this paper we study divisible load scheduling in systems with limited memory. Divisible loads are parallel computations which can be divided into independent parts of arbitrary sizes and processed in parallel on remote computers. The problem consists in distributing the load taking into account communication time, computation time, and limited memory buffers, such that the whole processing l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2020
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2020.05.015